Mining Closed Episodes from Event Sequences Efficiently
نویسندگان
چکیده
Recent studies have proposed different methods for mining frequent episodes. In this work, we study the problem of mining closed episodes based on minimal occurrences. We study the properties of minimal occurrences and design effective pruning techniques to prune non-closed episodes. An efficient mining algorithm Clo_episode is proposed to mine all closed episodes following a breadth-first search order and integrating the pruning techniques. Experimental results demonstrate the efficiency of our mining algorithm and the compactness of the mining result set.
منابع مشابه
MARBLES: Mining Association Rules Buried in Long Event Sequences
Sequential pattern discovery is a well-studied field in data mining. Episodes are sequential patterns that describe events that often occur in the vicinity of each other. Episodes can impose restrictions on the order of the events, which makes them a versatile technique for describing complex patterns in the sequence. Most of the research on episodes deals with special cases such as serial and ...
متن کاملA Polynomial-Delay Polynomial-Space Algorithm for Extracting Frequent Diamond Episodes from Event Sequences
In this paper, we study the problem of mining frequent diamond episodes efficiently from an input event sequence with sliding a window. Here, a diamond episode is of the form a → E → b, which means that every event of E follows an event a and is followed by an event b. Then, we design a polynomial-delay and polynomial-space algorithm PolyFreqDmd that finds all of the frequent diamond episodes w...
متن کاملDiscovering Representative Episodal Association Rules from Event Sequences Using Frequent Closed Episode Sets and Event Constraints
Discovering association rules from time-series data is an important data mining problem. The number of potential rules grows quickly as the number of items in the antecedent grows. It is therefore difficult for an expert to analyze the rules and identify the useful. An approach for generating representative association rules for transactions that uses only a subset of the set of frequent itemse...
متن کاملMining Frequent Diamond Episodes from Event Sequences
In this paper, we introduce a diamond episode of the form s1 → E → s2, where s1 and s2 are events and E is a set of events. The diamond episode s1 → E → s2 means that every event of E follows an event s1 and is followed by an event s2. Then, by formulating the support of diamond episodes, in this paper, we design the algorithm FreqDmd to extract all of the frequent diamond episodes from a given...
متن کاملA Framework for Mining Closed Sequential Patterns
Sequential pattern mining algorithms developed so far provide better performance for short sequences but are inefficient at mining long sequences, since long sequences generate a large number of frequent subsequences. To efficiently mine long sequences, closed sequential pattern mining algorithms have been developed. These algorithms mine closed sequential patterns which don’t have any super se...
متن کامل